Matrices with eigenvectors in a given subspace

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accurate Eigenvectors of Oscillatory Matrices

The purpose of this report is to investigate the possibilities for accurate computation of eigenvectors of (unsymmetric) oscillatory matrices. The goal is to decide what “accurate” means, to determine whether the eigenvectors are determined “accurately” in that sense, and to engineer algorithms that will guarantee that accuracy. It is desirable for the computed eigenvector matrix to inherit the...

متن کامل

Eigenvectors of random matrices: A survey

Eigenvectors of large matrices (and graphs) play an essential role in combinatorics and theoretical computer science. The goal of this survey is to provide an up-to-date account on properties of eigenvectors when the matrix (or graph) is random.

متن کامل

Ela Eigenvalues and Eigenvectors of Tridiagonal Matrices

This paper is continuation of previous work by the present author, where explicit formulas for the eigenvalues associated with several tridiagonal matrices were given. In this paper the associated eigenvectors are calculated explicitly. As a consequence, a result obtained by WenChyuan Yueh and independently by S. Kouachi, concerning the eigenvalues and in particular the corresponding eigenvecto...

متن کامل

Delocalization of Eigenvectors of Random Matrices with Independent Entries

We prove that an n× n random matrix G with independent entries is completely delocalized. Suppose the entries of G have zero means, variances uniformly bounded below, and a uniform tail decay of exponential type. Then with high probability all unit eigenvectors of G have all coordinates of magnitude O(n−1/2), modulo logarithmic corrections. This comes a consequence of a new, geometric, approach...

متن کامل

Real symmetric matrices 1 Eigenvalues and eigenvectors

A matrix D is diagonal if all its off-diagonal entries are zero. If D is diagonal, then its eigenvalues are the diagonal entries, and the characteristic polynomial of D is fD(x) = ∏i=1(x−dii), where dii is the (i, i) diagonal entry of D. A matrix A is diagonalisable if there is an invertible matrix Q such that QAQ−1 is diagonal. Note that A and QAQ−1 always have the same eigenvalues and the sam...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2012

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-2012-11404-2